Molecular Algorithms for Eecient and Reliable Dna Computing
نویسنده
چکیده
Two new molecular algorithms are presented that are designed for the improvement of ee-ciency and reliability of DNA computing. The rst algorithm introduces an evolutionary cycle to guide chemical reactions of DNA molecules. The second molecular algorithm extends the rst one by adding another evolutionary loop for optimizing encodings of the problem instance. Just as genetic programming is a method for programming conventional computers by means of natural evolution, our approach, which might be called molecular programming, provides a method for programming biocomputers by means of ar-tiicial evolution. Simulations have been performed with the Hamiltonian path problem to verify the positive eeect of the presented molecular algorithms on the reliability and eeciency of DNA computing.
منابع مشابه
Parallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملSimple procedure for production of short DNA size markers of 100 to 2000 bp
DNA size markers (ladder) are essential tools in molecular biology, genetics and biotechnology. In this study, a simple and cost-effective method for laboratory production of DNA ladders is introduced. For this purpose, different sizes of 100 to 2000 bp DNA segments were designed using PCR technique. For producing 14 different gene fragments as DNA molecular weight markers, recombinant plasmid ...
متن کاملINTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...
متن کاملIs Quantitative HBsAg Measurement a Reliable Substitute for HBV DNA Quantitation?
Background: Hepatitis B surface antigen (HBsAg) is one of the main proteins of HBV envelop and its serum quantitative measurement is the most common quantitative test for monitoring the progress of Chronic Hepatitis B. Although measurement of serum HBV DNA copy number is a gold standard method for displaying viral load, the test is relatively expensive and it is not readily available everywhere...
متن کامل